Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design

Approximation Algorithms for Buy-at-Bulk Geometric Network Design

The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all points in a Euclidean space are candidates for network nodes. We present the first general approach for geometric versions of basic variants of the buy-at-bulk network design problem. It enables us to obtain quasi-polynomial-ti...

Oblivious Buy-at-bulk Network Design Algorithms

Large-scale networks such as the Internet has emerged as arguably the most complex distributed communication network system. The mere size of such networks and all the various applications that run on it brings a large variety of challenging problems. Similar problems lie in any network transportation, logistics, oil/gas pipeline etc where efficient paths are needed to route the flow of demands...

Buy-at-Bulk Network Design

The essence of the simplest buy-at-bulk network design problem is buying network capacity "whole-sale" to guarantee connectivity from all network nodes to a certain central network switch. Capacity is sold with "volume discount": the more capacity is bought, the cheaper is the price per unit of bandwidth. We provide O(log 2 n) randomized approximation algorithm for the problem. This solves the ...

Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design

We study problems that integrate buy-at-bulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client demand to an open facility. Furthermore, capacities of the edges can be purchased in discrete units from K different cable types with costs that satisfy economies of scale. We extend th...